au.\*:("CHLEBUS BS")
Results 1 to 2 of 2
Selection :
ON THE COMPUTATIONAL COMPLEXITY OF SATISFIABILITY IN PROPOSITIONAL LOGICS OF PROGRAMSCHLEBUS BS.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 2; PP. 179-212; BIBL. 18 REF.Article
ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGICCHLEBUS BS.1982; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1982; VOL. 28; NO 3; PP. 247-261; BIBL. 8 REF.Article
